Colimits of order-sorted specifications
نویسنده
چکیده
We prove cocompleteness of the category of CASL signatures , of monotone signatures, of strongly regular signatures and of strongly locally ltered signatures. This shows that using these signature categories is compatible with a pushout or colimit based module system.
منابع مشابه
A Method to Translate Order-Sorted Algebras to Many-Sorted Algebras
Order-sorted algebras and many sorted algebras exist in a long history with many different implementations and applications. A lot of language specifications have been defined in order-sorted algebra frameworks such as the language specifications in K (an order-sorted algebra framework). The biggest problem in a lot of the order-sorted algebra frameworks is that even if they might allow develop...
متن کاملCanonical Selection of Colimits
Colimits are a powerful tool for the combination of objects in a category. In the context of modeling and specification, they are used in the institution-independent semantics (1) of instantiations of parameterised specifications (e.g. in the specification language CASL), and (2) of combinations of networks of specifications (in the OMG standardised language DOL). The problem of using colimits ...
متن کاملA Language for Configuring Multi-level Specifications
This paper shows how systems can be built from their component parts with specified sharing. Its principle contribution is a modular language for configuring systems. A configuration is a description in the new language of how a system is constructed hierarchically from specifications of its component parts. Category theory has been used to represent the composition of specifications that share...
متن کاملDecidable Fragments of Many-Sorted Logic
We investigate the possibility of developing a decidable logic which allows expressing a large variety of real world specifications. The idea is to define a decidable subset of many-sorted (typed) firstorder logic. The motivation is that types simplify the complexity of mixed quantifiers when they quantify over different types. We noticed that many real world verification problems can be formal...
متن کاملClassified Model: Abstract Data Type Specification∗
Abstract Data Types (ADTs) can be specified by the Classified Model (CM) specification language—a first-order Horn language with equality and sort “classification” assertions. Sort assertions generalize the traditional syntactic signatures of ADT specifications, resulting in all of the specification capability of traditional equational specifications, but with the improved expressibility of the...
متن کامل